vertex connectivity

The Algebraic and Vertex Connectivity of Graphs

图的代数连通度及其点连通度

Because the models for line connectivity, for vertex connectivity, and for network connectivity have been long studied and have become ripened, the model for patch connectivity is paid special attention in this paper.

因为点连通性、线连通性和网连通性己有很长的研究历史，相应的连通性模型（连通度）己比较成熟，所以本文的研究焦点是尚不成熟的斑块连通性模型。

Then it is proved that the smallest vertex degree, vertex connectivity and link connectivity are all n, which is holding the best connectivity the same as the hypercube and the crossed cube.

然后证明了n维HCH-立方体互连网络的最小顶点度数和顶点连通度和边连通度为n，保持了超立方体和交叉立方体的最高连通度的优点；

This paper presents a new triangle mesh compression/ decompression algorithm, which breaks down a triangle mesh into a set of triangle strips and vertex chains, and then encodes vertex connectivity with entropy encoding.

本文提出了一种新的三角形网格压缩/解压缩算法，该算法将三角形网格分解成一组三角形条和序列顶点链，然后对顶点连通性进行熵编码。

The models for landscape connectivity are distinguished into model for line connectivity, one for vertex connectivity, another for network connectivity and still another for patch connectivity.

景观连通性模型可区分为点连通性模型，线连通性模型，网连通性模型和斑块连通性模型。